A new upper bound for 3-SAT
نویسندگان
چکیده
We show that a randomly chosen 3-CNF formula over n variables with clauses-tovariables ratio at least 4.4898 is asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506. The first such bound, independently discovered by many groups of researchers since 1983, was 5.19. Several decreasing values between 5.19 and 4.506 were published in the years between. The probabilistic techniques we use for the proof are, we believe, of independent interest.
منابع مشابه
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
Abstract. We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the num...
متن کاملAnother proof for an upper bound of a local search algorithm for 3 - SAT
We present another proof for an upper bound of a deterministic local search algorithm [3] for 3-SAT. This bound O(1.481n) is currently no longer the best (where n is the number of variables) while the best bound is slightly better: O(1.473n) due to [1].
متن کاملNew upper bound for the #3-SAT problem
We present a new deterministic algorithm for the #3-SAT problem, based on the DPLL strategy. It uses a new approach for counting models of instances with low density. This allows us to assume the adding of more 2-clauses than in previous algorithms. The algorithm achieves a running time of O(1.6423) in the worst case which improves the current best bound of O(1.6737) by Dahllöf et al.
متن کاملA New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
Knowing a Backdoor Sets B for a given Sat instance, satisfiability can be decided by only examining each of the 2|B| truth assignments of the variables in B. However, one problem is to efficiently find a small backdoor up to a particular size and, furthermore, if no backdoor of the desired size could be found, there is in general no chance to conclude anything about satisfiability. In this pape...
متن کاملA Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable
The (k, s)-SAT problem is the satisfiability problem restricted to instances where each clause has exactly k literals and every variable occurs at most s times. It is known that there exists a function f such that for s ≤ f(k) all (k, s)-SAT instances are satisfiable, but (k, f(k)+1)-SAT is already NP-complete (k ≥ 3). We prove that f(k) = O(2 · log k/k), improving upon the best know upper boun...
متن کاملNew Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
MAX-2-SAT and MAX-2-CSP are important NP-hard optimization problems generalizing many graph problems. Despite many efforts, the only known algorithm (due to Williams) solving them in less than 2 steps uses exponential space. Scott and Sorkin give an algorithm with 2 2 d+1 ) time and polynomial space for these problems, where d is the average variable degree. We improve this bound to O∗(2 10/3 d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008